Incremental Construction of a Lexical Transducer for Korean
نویسندگان
چکیده
The paper describes the construction of a lexical transducer for Korean tha t can be used for s temming a n d generation. The method contains two innovations: (1) two h.'vel rules ms well-formedness constraints in the initial phase; (2) the combinat ion of intersection and composit ion of rule t ransducers in a dee[) cascade ['or the final re.suit.
منابع مشابه
Incremental construction and maintenance of morphological analysers based on augmented letter transducers
We define deterministic augmented letter transducers (DALTs), a class of finitestate transducers which provide an efficient way of implementing morphological analysers which tokenize their input (i.e., divide texts in tokens or words) as they analyse it, and show how these morphological analysers may be maintained (i.e., how surface form–lexical form transductions may be added or removed from t...
متن کاملKlex: A Finite-State Transducer Lexicon of Korean
This paper describes the implementation and system details of Klex, a finite-state transducer lexicon for the Korean language, developed using XRCE’s Xerox Finite State Tool (XFST). Klex is essentially a transducer network representing the lexicon of the Korean language with the lexical string on the upper side and the inflected surface string on the lower side. Two major applications for Klex ...
متن کاملIncremental composition of static decoding graphs
A fast, scalable and memory-efficient method for static decoding graph construction is presented. As an alternative to the traditional transducer-based approach, it is based on incremental composition. Memory efficiency is achieved by combining composition, determinization and minimization into a single step, thus eliminating large intermediate graphs. We have previously reported the use of inc...
متن کاملIncremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) for a dictionary consisting of a list of input and output strings. The algorithm generalises a known method of constructing minimal finite-state automata (Daciuk et al., 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings...
متن کاملIncremental Construction of Minimal Sequential Transducers
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finite-state automata (Daciuk, Mihov, Watson and Watson 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings to be s...
متن کامل